Degree Conditions of Fractional ID-k-Factor-Critical Graphs
نویسنده
چکیده
We say that a simple graph G is fractional independent-set-deletable k-factor-critical, shortly, fractional ID-k-factor-critical, if G− I has a fractional k-factor for every independent set I of G. Some sufficient conditions for a graph to be fractional ID-k-factor-critical are studied in this paper. Furthermore, we show that the result is best possible in some sense. 2010 Mathematics Subject Classification: 05C70
منابع مشابه
A neighborhood condition for fractional ID-[a, b]-factor-critical graphs
A graph G is fractional ID-[a, b]-factor-critical if G − I has a fractional [a, b]-factor for every independent set I of G. We extend a result of Zhou and Sun concerning fractional ID-k-factor-critical graphs.
متن کاملA degree condition for graphs to be fractional ID-[a, b]-factor-critical
Let G be a graph of sufficiently large order n, and let a and b be integers with 1 ≤ a ≤ b. Let h : E(G) → [0, 1] be a function. If a ≤ ∑x∈e h(e) ≤ b holds for any x ∈ V (G), then G[Fh] is called a fractional [a, b]-factor of G with indicator function h, where Fh = {e ∈ E(G) | h(e) > 0}. A graph G is fractional independent-set-deletable [a, b]-factor-critical (simply, fractional ID-[a, b]-facto...
متن کاملA result on fractional ID-[a, b]-factor-critical graphs
A graphG is fractional ID-[a, b]-factor-critical ifG−I includes a fractional [a, b]-factor for every independent set I of G. In this paper, it is proved that if α(G) ≤ 4b(δ(G)−a+1) (a+1)2+4b , then G is fractional ID-[a, b]-factor-critical. Furthermore, it is shown that the result is best possible in some sense.
متن کاملTwo sufficient conditions for fractional k-deleted graphs
Let G be a graph, and k a positive integer. A fractional k-factor is a way of assigning weights to the edges of a graph G (with all weights between 0 and 1) such that for each vertex the sum of the weights of the edges incident with that vertex is k. A graph G is a fractional k-deleted graph if G − e has a fractional k-factor for each e ∈ E(G). In this paper, we obtain some sufficient condition...
متن کاملDistinguishing number and distinguishing index of natural and fractional powers of graphs
The distinguishing number (resp. index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (resp. edge labeling) with $d$ labels that is preserved only by a trivial automorphism. For any $n in mathbb{N}$, the $n$-subdivision of $G$ is a simple graph $G^{frac{1}{n}}$ which is constructed by replacing each edge of $G$ with a path of length $n$...
متن کامل